Descriptive Complexity of Computable Sequences

نویسندگان

  • Bruno Durand
  • Alexander Shen
  • Nikolai K. Vereshchagin
چکیده

Our goal is to study the complexity of infinite binary recursive sequences. We introduce several measures of the quantity of information they contain. Some measures are based on size of programs that generate the sequence, the others are based on the Kolmogorov complexity of its finite prefixes. The relations between these complexity measures are established. The most surprising among them are obtained using a specific two-players game.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Game Representations of Complexity Classes

Many descriptive and computational complexity classes have game-theoretic representations. These can be used to study the relation between diierent logics and complexity classes in nite model theory. The notion of representing a property as a game is an old one. I claim that a given graph is connected, you deny it and demand that I connect a pair of vertices of your choice, etc. However, it is ...

متن کامل

Loss Bounds and Time Complexity for Speed Priors

This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently computable. We propose a variant to the original speed prior (Schmidhuber, 2002), and show that our prior can predict sequences drawn from probability measure...

متن کامل

Polynomial time computable real functions

In this paper, we study computability and complexity of real functions. We extend these notions, already defined for functions over closed intervals or over the real line to functions over particular real open sets and give some results and characterizations, especially for polynomial time computable functions. Our representation of real numbers as sequences of rational numbers allows us to imp...

متن کامل

On Innnite Sequences (almost) as Easy As

It is known that innnite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might suggest, there are sequences of constant, polynomial-time bounded Kolmogorov complexity that are not polynomial-time computable. This motivates the study of several resource-bound...

متن کامل

More About Recursive Structures: Descriptive Complexity and Zero-One Laws

This paper continues our work on innnite, recursive structures. We investigate the descriptive complexity of several logics over recursive structures, including rst-order, second-order, and xpoint logic, exhibiting connections between expressibility of a property and its computational complexity. We then address 0{1 laws, proposing a version that applies to recursive structures, and using it to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999